Inefficient Prebargaining Search

Inefficient pre-bargaining search

The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract We identify conditions under which a bargainer makes inefficiently large (small) investments in search for information about the opponent's reservation price. The analysis starts with the observation that a player will invest too much (too little) if the opponent's exp...

INEFFICIENT PRE-BARGAINING SEARCH By

Inefficient visual search for second-order motion.

Visual search rate was used to assess attentional resources required for detection of opposing motions defined either by luminance or by modulations of texture contrast, flicker, or size. Though luminance-based targets were detected quickly, search through second-order motion was slow. Control experiments ruled out stimuli visibility, complexity, eccentricity sensitivity, and attributes of the ...

Active search for multiple targets is inefficient

This study examines saccade strategy in a novel task where observers actively search a display to find multiple targets in a limited time. Theory predicts that the relative merit of different saccade strategies depends on the prior probability of the target at a location: when the target prior is low and multiple-target trials are rare, making a saccade to the most likely target location is clo...

Automatic search for patterns of inefficient behavior in parallel applications

Event tracing is a powerful method of analyzing the performance behavior of parallel applications. Because event traces record the temporal and spatial relationships between individual runtime events, they allow application developers to analyze dependences of performance phenomena across concurrent control flows. However, in view of the large amounts of data generated on contemporary parallel ...